Scalable Contour Tree Computation by Data Parallel Peak Pruning
نویسندگان
چکیده
منابع مشابه
Skeleton Pruning by Contour Partitioning
In this paper, we establish a unique correspondence between skeleton branches and subarcs of object contours. Based on this correspondence, a skeleton is pruned by removing skeleton branches whose generating points are on the same contour subarc. This has an effect of removing redundant skeleton branches and retaining all the necessary visual branches. We show that this approach preserves skele...
متن کاملPruning Game Tree by Rollouts
In this paper we show that the α-β algorithm and its successor MT-SSS*, as two classic minimax search algorithms, can be implemented as rollout algorithms, a generic algorithmic paradigm widely used in many domains. Specifically, we define a family of rollout algorithms, in which the rollout policy is restricted to select successor nodes only from a subset of the children list. We show that any...
متن کاملScalable Duplicate Pruning Strategies for Parallel A* Graph Search
In parallel A * graph search on distributed-memory machines, different processors may perform significant duplicated work if inter-processor duplicates are not pruned. The only known method for duplicate pruning associates a particular processor with each distinct node of the search space using a suitable hash function. Then duplicate nodes arising in different processors are transmitted to the...
متن کاملA Scalable Parallel Tree Search Library
This paper reports design and implementation experiences with the portable and reusable library PIGSeL for parallel tree search. It is discussed how eeciency, exibility and usability of the library can be reconciled. Two sample applications demonstrate its eeectiveness for the case of parallel depth-rst search. On a mesh of 1024 Trans-puters near optimal speedup even for small instances of the ...
متن کامل(ACM SRC Poster) PEAK: Parallel EM Algorithm using Kd-tree
The data mining community voted Expectation Maximization (EM) algorithm as one of the top ten algorithms having the most impact on data mining research [5]. EM is a popular iterative algorithm for learning mixture models with applications in various areas from computer vision, astronomy, to signal processing. We present a new high-performance parallel algorithm on multicore systems that impacts...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Visualization and Computer Graphics
سال: 2021
ISSN: 1077-2626,1941-0506,2160-9306
DOI: 10.1109/tvcg.2019.2948616